منابع مشابه
Designing a Calculational Proof of Cantor's Theorem
The one purpose of this little Note is to show that formal arguments need not be lengthy at all; on the contrary, they are often the most compact rendering of the argument. Its other purpose is to show the strong heuristic guidance that is available to us when we design such calculational proofs in sufficiently small, explicit steps. We illustrate our approach on Georg Cantor’s classic diagonal...
متن کاملScans and Convolutions - A Calculational Proof of Moessner's Theorem
The paper introduces two corecursion schemes for streamgenerating functions, scans and convolutions, and discusses their properties. As an application of the framework, a calculational proof of Paasche’s generalisation of Moessner’s intriguing theorem is presented.
متن کاملStructured Proof Procedures
17 The number of literals of the corresponding negative normal forms is given by L(n) = 4 n +6 P n?2 k=0 4 k (the number of literals of the corresponding clausal forms grows even faster). Hence the translation process alone is of exponential complexity both in time and in space. On the other hand the space required by PTAUT grows only polynomially with n, while the time grows as 2 n. Future wor...
متن کاملStructured Incremental Proof Planning
We extend our framework of incremental proof planning. By employing nested sets of metarules the formulation of strategies may be structured. By switching to another metarule set the planner can adjust to a new situation within the proof. The new metarule set represents a more specialized strategy better suited for the current situation. We deene the semantics of our framework by an inference s...
متن کاملMeta-Proof for Structured Specifications
We are working on a practical, template-based approach to the formalisation of object-oriented models. In previous papers, which demonstrate the approach, we have asserted that the formal proofs required for consistency checking and analysis of the model, are also amenable to a template-based solution, using modular metaproofs. In this paper, we explain the meta-proof concept, and illustrate it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 1997
ISSN: 0934-5043,1433-299X
DOI: 10.1007/bf01211456